Forcing Disjoint Segments in the Plane
نویسندگان
چکیده
Consider a geometric graph given by n points in the plane (in general position) andm line segments, each segment joining a pair of the given points. We show that: if m ≥ 3n + 1 then there are 3 pairwise disjoint segments; if m ≥ 10n + 1 then there are 4 disjoint segments; and if m ≥ ckn(log n) k−4 then there are k disjoint segments.
منابع مشابه
Anti-forcing number of some specific graphs
Let $G=(V,E)$ be a simple connected graph. A perfect matching (or Kekul'e structure in chemical literature) of $G$ is a set of disjoint edges which covers all vertices of $G$. The anti-forcing number of $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching and is denoted by $af(G)$. In this paper we consider some specifi...
متن کاملDisjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs
The empty space around n disjoint line segments in the plane can be partitioned into n+ 1 convex faces by extending the segments in some order. The dual graph of such a partition is the plane graph whose vertices correspond to the n+1 convex faces, and every segment endpoint corresponds to an edge between the two incident faces on opposite sides of the segment. We construct, for every set of n ...
متن کاملA Long Noncrossing Path Among Disjoint Segments in the Plane
Let L be a collection of n pairwise disjoint segments in general position in the plane. We show that one can find a subcollection of Ω(n1/3) segments that can be completed to a noncrossing simple path by adding rectilinear edges between endpoints of pairs of segments. On the other hand, there is a set L of n segments for which no subset of size (2n)1/2 or more can be completed to such a path.
متن کاملAlternating paths through disjoint line segments
We show that every segment endpoint visibility graph on disjoint line segments in the plane admits an alternating path of length , answering a question of Bose. This bound is optimal apart from a constant factor. We also give bounds on the constants hidden by the asymptotic notation.
متن کاملA Ramsey-type Result for Convex Sets
Given a family of n convex compact sets in the plane, one can always choose n of them which are either pairwise disjoint or pairwise intersecting. On the other hand, there exists a family of n segments in the plane such that the maximum size of a subfamily with pairwise disjoint or pairwise intersecting elements in n*"* ^ n-.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 17 شماره
صفحات -
تاریخ انتشار 1996